Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice
نویسندگان
چکیده
We prove that a graph is 4-colorable if and only if it can be drawn with vertices in the integer lattice, using as edges only line segments not containing a third point of the lattice.
منابع مشابه
Mixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کاملApproximating the Maximum 3- and 4-Edge-Colorable Subgraph
We study large k-edge-colorable subgraphs of simple graphs and multigraphs. We show that: – every simple subcubic graph G has a 3-edge-colorable subgraph (3ECS) with at least 13 15 |E(G)| edges, unless G is isomorphic to K4 with one edge subdivided, – every subcubic multigraph G has a 3-ECS with at least 7 9 |E(G)| edges, unless G is isomorphic to K3 with one edge doubled, – every simple graph ...
متن کاملVertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
A graph G is (k, 0)-colorable if its vertices can be partitioned into subsets V1 and V2 such that in G[V1] every vertex has degree at most k, while G[V2] is edgeless. For every integer k ≥ 1, we prove that every graph with the maximum average degree smaller than 3k+4 k+2 is (k, 0)-colorable. In particular, it follows that every planar graph with girth at least 7 is (8, 0)-colorable. On the othe...
متن کاملA Ramsey-Type Theorem for Traceable Graphs*
A graph G is traceable if there is a path passing through all the vertices of G. It is proved that every infinite traceable graph either contains arbitrarily large ftnite chordless paths, or contains a subgraph isomorphic to graph A, illustrated in the text. A corollary is that every Jinitely generated infinite lattice of length 3 contains arbitrarily large jkite fences. It is also proved that ...
متن کامل